Two asynchronous parallel algorithms for function optimization 求解函數優化問題的兩種異步并行算法
An asynchronous parallel algorithm about the secant method for solving nonlinear systems of equations 一個用割線法求解非線性方程組的異步并行算法
Firstly , based on the parallel halley circular iteration method , the asynchronous parallel algorithm and fast parallel halley algorithm for finding all zeros of a polynomial are constructed . the convergence rate of third order and seventh order is obtained under the similar condition of halley iteration method , by which the calculation efficiency of halley iteration method is improved greatly 首先,在并行halley圓盤迭代法的基礎上,提出了求多項式全部零點的異步并行算法和快速并行halley算法,它們在與halley迭代法類似的條件下分別達到了三階和七階收斂速度,從而大大提高了halley迭代法的計算效率。